Heuristics for Large Strip Packing Problems with Guillotine Patterns: an Empirical Study
نویسندگان
چکیده
We undertake an empirical study in which the performance of a good genetic algorithm is tested against some well-known bin packing heuristics on a range of two-dimensional bin packing problems. We restrict our study to problems involving guillotine patterns which are produced using a series of vertical and horizontal edge–to–edge cuts. Many applications of two-dimensional cutting and packing in the glass, wood, and paper industries, for example, are restricted to guillotine cutting.
منابع مشابه
A fast layer-based heuristic for non-guillotine strip packing
In this paper, an orthogonal strip packing problem with rotation of items and without the guillotine packing constraint is considered. A fast heuristic algorithm for the large-scale problems is presented. This heuristic algorithm is mainly based on heuristic strategies inspired by the wall-building rule of bricklayers in daily life. The heuristics is simple and the setting of parameter is not r...
متن کاملOn a Genetic-Tabu Search Based Algorithm for Two-Dimensional Guillotine Cutting Problems
The paper deals with the purpose of one hybrid approach for solving the constrained two-dimensional cutting (2DC) problem. The authors study this hybrid approach that combines the genetic algorithm and the Tabu search method. For this problem, they assume a packing of a whole number of rectangular pieces to cut, and that all cuts are of guillotine type in one sheet of a fixed width and an infin...
متن کاملConstructive procedures to solve 2-Dimensional Bin Packing Problems with Irregular Pieces and Guillotine Cuts
This paper presents an approach for solving a new real problem in Cutting and Packing. At its core is an innovative mixed integer programme model that places irregular pieces and defines guillotine cuts. The two-dimensional irregular shape bin packing problem with guillotine constraints arises in the glass cutting industry, for example, the cutting of glass for conservatories. Almost all cuttin...
متن کاملOptimization of the retail steel distribution industry
The present work proposes new heuristics and algorithms for the 3D Cutting and Packing class of problems. Specifically the cutting stock problem and a real-world application from the retail steel distribution industry are addressed. The problem being addressed for the retail steel distribution industry is the retail steel cutting problem, which is how to cut steel in order to satisfy the custom...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کامل